|
|
Graphics Graph Representation
Matula, Radek ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph vertices in order to obtain the most clear and readable graphs for human readers. The main objective of this work was also to implement the drawing algorithm in the application that would allow to edit the graph. This work deals also with graphs representation in computers.
|
|
|
Graphical Vizualization of Routing Algorithms
Pokorný, Martin ; Gajda, Zbyšek (referee) ; Jaroš, Jiří (advisor)
The aim of this bachelor's thesis is illustrate network topology, e.g . computers or processor, and communication in this network. The network can be displayed like a various topology, which is possible to manually modify. Position and interconnection of vertex is stored in delivered file. Second part of program is on displayed topology demonstrate collective communication between vertex. The kind of collective communication depend on selected routing algorithm, which is again stored in delivered file. Program output can be saved in the form of raster picture or XML document.
|
|
|
Graphical Vizualization of Routing Algorithms
Pokorný, Martin ; Gajda, Zbyšek (referee) ; Jaroš, Jiří (advisor)
The aim of this bachelor's thesis is illustrate network topology, e.g . computers or processor, and communication in this network. The network can be displayed like a various topology, which is possible to manually modify. Position and interconnection of vertex is stored in delivered file. Second part of program is on displayed topology demonstrate collective communication between vertex. The kind of collective communication depend on selected routing algorithm, which is again stored in delivered file. Program output can be saved in the form of raster picture or XML document.
|
|
|
Graphics Graph Representation
Matula, Radek ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph vertices in order to obtain the most clear and readable graphs for human readers. The main objective of this work was also to implement the drawing algorithm in the application that would allow to edit the graph. This work deals also with graphs representation in computers.
|
guest ::
